AUTOMATED MATCHING CROWDSOURCING ROAD NETWORKS USING PROBABILISTIC RELAXATION
نویسندگان
چکیده
منابع مشابه
Automated Matching Crowdsourcing Road Networks Using Probabilistic Relaxation
Geospatial data matching is an important prerequisite for data integration, change detection, and data updating. Presently, crowdsourcing geospatial data is drawing great attention with its significant potential for geospatial data updating and Location Based Services, etc. To explore the availabilities of crowdsourcing geospatial data, the paper proposes a heuristic probabilistic relaxation ro...
متن کاملMatching of Road Segments Using Probabilistic Relaxation: a Hierarchical Approach
Probabilistic relaxation has been used previously as the basis for the development of an algorithm to match features extracted from an image with corresponding features from a model. The technique has proved very successful, especially in applications that require real-time performance. On the other hand its use has been limited to small problems, because the complexity of the algorithm varies ...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Matching of Road Segments Using Probabilistic Relaxation: Reducing the Computational Requirements
In previous work we presented an algorithm for matching features extracted from an image with those extracted from a model, using a probabilistic relaxation method. We tested the algorithm by using it to locate on a map road segments extracted from an aerial image. The algorithm performed well, and in particular converged very rapidly. Because the algorithm compares each possible match with all...
متن کاملCurve Matching with Probabilistic Relaxation
Reliable curve matching is a difficult proble~rl but is required in Inany visio11-based applicatio~ls. It is particularly difficult when the edges in question are not li~rlited to be on straight lines. Our 1riai11 corltribution in this paper is to propose a new algorithr~i for curve matching (illcludi~lg lines). The nlethod is described within a probabilistic relaxatio~l fra~rlework. Novel si~~...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
سال: 2012
ISSN: 2194-9050
DOI: 10.5194/isprsannals-i-4-281-2012